Computational Complexity, NP Completeness and Optimization Duality: A Survey
نویسندگان
چکیده
We survey research that studies the connection between the computational complexity of optimization problems on the one hand, and the duality gap between the primal and dual optimization problems on the other. To our knowledge, this is the first survey that connects the two very important areas. We further look at a similar phenomenon in finite model theory relating to complexity and optimization.
منابع مشابه
Duality Gap, Computational Complexity and NP Completeness: A Survey
We survey research that studies the connection between the computational complexity of optimization problems on the one hand, and the duality gap between the primal and dual optimization problems on the other. To our knowledge, this is the first survey that connects the two very important areas. We further look at a similar phenomenon in finite model theory relating to complexity and optimization.
متن کاملMaximizing Barber's bipartite modularity is also hard
Abstract Modularity introduced by Newman and Girvan [Phys. Rev. E 69, 026113 (2004)] is a quality function for community detection. Numerous methods for modularity maximization have been developed so far. In 2007, Barber [Phys. Rev. E 76, 066102 (2007)] introduced a variant of modularity called bipartite modularity which is appropriate for bipartite networks. Although maximizing the standard mo...
متن کاملComputational complexity of the quantum separability problem
Ever since entanglement was identified as a computational and cryptographic resource, researchers have sought efficient ways to tell whether a given density matrix represents an unentangled, or separable, state. This paper gives the first systematic and comprehensive treatment of this (bipartite) quantum separability problem, focusing on its deterministic (as opposed to randomized) computationa...
متن کاملComputationally Intractable Problems in Communications
The theory of NP-completeness deals with problems for which we do not know a deterministic algorithm for finding the solution in an amount of time polynomial in the size of the input. These problems—belonging to the set N P-complete—are of great practical importance because they arise naturally in numerous decision and optimization problems [Baas]. Yet, no one has shown whether such problems ca...
متن کاملNp Completeness of Kauuman's N-k Model, a Tuneably Rugged Fitness Landscape
The concept of a \\tness landscape", a picturesque term for a mapping of the vertices of a nite graph to the real numbers, has arisen in several elds, including evolutionary theory. The computational complexity of two, qualitatively similar versions of a particularly simple tness landscape are shown to diier considerably. In one version, the question \Is the global optimum greater than a given ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 19 شماره
صفحات -
تاریخ انتشار 2012